Cyclic Bernoulli polling

Cyclic Bernoulli Polling I

We introduce, analyse and optimize the class of Bernoulli random polling systems. The server moves cyclically among N channels (queues), but Change-over times between stations are composed of walking times required to 'move' from one channel to another and switch-in times that are incurred only when the server actually enters a station to render service. The server uses a Bernoulli random mecha...

Cyclic Bernoulli polling

Optimization of Polling Systems with Bernoulli Schedules

Many computer-communication networks in which the transmission right is circulated among the nodes have been modeled as polling systems. This paper concerns optimization of cyclic polling systems with respect to the service disciplines at the nodes. The service disciplines are chosen to be Bernoulli schedules. Because the optimization problem is not analytically tractable, a numerical approach ...

An Introduction to Classical Cyclic Polling Model

An alternative analysis of the classical M/G/1 cyclic order polling model is presented. We introduce the new Markov regenerative process framework, which provides a way to perform the analysis of the polling model on a unified, i.e. service discipline independent way. We derive the decomposition property and the general expressions of the stationary number of customers as well as the stationary...

Cyclic-type Polling Models with Preparation Times

We consider a system consisting of a server serving in sequence a fixed number of stations. At each station there is an infinite queue of customers that have to undergo a preparation phase before being served. This model is connected to layered queuing networks, to an extension of polling systems, and surprisingly to random graphs. We are interested in the waiting time of the server. The waitin...